Forming tile shapes with simple robots
نویسندگان
چکیده
منابع مشابه
On Times to Compute Shapes in 2D Tile Self-assembly
We study the times to grow structures within the tile self-assembly model proposed by Winfree, and the possible shapes that can be achieved. Our earlier work was confined to the growth of rectangular structures, in which the rates of attachment of border tiles and rule tiles were the same. By varying the relative rates one can engineer interesting new shapes, which have been observed in the lab...
متن کاملSelf - Reconfigurable Robots ― Cellular robots that transform their shapes ―
In this article, we review the concept of a cellular robot that is capable of reconfiguring itself. This “Self-Reconfigurable (SR) Robot” exemplifies a new trend in robotics. Indeed, we can now build various kinds of SR robots by off-the-shelf technologies of processors, actuators, and sensors. These SR robots, based on modern mechatronics, are still not as adaptable as the liquid metal robot i...
متن کاملReconstructing Visibility Graphs with Simple Robots
We consider the problem of finding a minimalistic configuration of sensors that enable a simple robot inside an initially unknown polygon P on n vertices to reconstruct the visibility graph of P . The robot can sense features of its environment through its sensors, and it is allowed to move from vertex to vertex. We aim at understanding which sensorial capabilities are sufficient for the recons...
متن کاملFilling Space with Random Fractal Non-Overlapping Simple Shapes
We present an algorithm that randomly places simple shapes (circles, squares, triangles, and others) without overlap in two dimensions. We describe the mathematics of the process in detail with some conjectures about its properties. The distribution of the areas of the shapes is a power law with varying exponents (typically around -1.3 for visual art). When the algorithm continues "to infinity"...
متن کاملTriangulation of Simple 3D Shapes with Well-Centered Tetrahedra
A completely well-centered tetrahedral mesh is a triangulation of a three dimensional domain in which every tetrahedron and every triangle contains its circumcenter in its interior. Such meshes have applications in scientific computing and other fields. We show how to triangulate simple domains using completely well-centered tetrahedra. The domains we consider here are space, infinite slab, inf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Natural Computing
سال: 2019
ISSN: 1567-7818,1572-9796
DOI: 10.1007/s11047-019-09774-2